A heuristic algorithm for computing the max–min inverse fuzzy relation
نویسندگان
چکیده
منابع مشابه
A heuristic algorithm for computing the max-min inverse fuzzy relation
The paper addresses a classical problem of computing approximate max–min inverse fuzzy relation. It is an NP-complete problem for which no polynomial time algorithm is known till this date. The paper employs a heuristic function to reduce the search space for finding the solution of the problem. The time-complexity of the proposed algorithm is OðnÞ, compared to OðknÞ, which is required for an e...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولAn Efficient Algorithm to Computing Max-Min Post-inverse Fuzzy Relation for Abductive Reasoning
This paper provides an alternative formulation to computing the max–min inverse fuzzy relation by embedding the inherent constraints of the problem into a heuristic (objective) function. The optimization of the heuristic function guarantees maximal satisfaction of the constraints, and consequently, the condition for optimality yields solution to the inverse problem. An algorithm for computing t...
متن کاملHeuristic Algorithm for Client - Server Distributed Computing
The distributed processing systems contain many nodes connected into one logical structure that is able to perform the processing of given task. The task is submitted by the system operator – and from his point of view the system is inputted with a task, computing layer processes the task and the result is returned by the system. Such layer-oriented approach requires to design the operational m...
متن کاملA new heuristic algorithm of fuzzy clustering
This paper deals with a new method of fuzzy clustering. The basic concepts of the method are introduced as resulting from the consideration of the fundamental fuzzy clustering problem. The paper provides the description of the general plan of the algorithm and an illustrative example. An analysis of the experimental results of the method’s application to the Anderson’s Iris data is carried out....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2002
ISSN: 0888-613X
DOI: 10.1016/s0888-613x(02)00069-5